View updates in stratified disjunctive databases

View Updates in Stratiied Disjunctive Databases*

View Updates in Disjunctive Deductive Databases Based on SLD-Resolution

View update problem in deductive databases is concerned with the translation of an update of an intensional relation by modifying the underlying relations of the extensional part of the database. In the existing algorithms for view updates of a deductive database, a sound and complete proof procedure is usually employed to generate explanations for the atom to be inserted or deleted. In the cas...

Disjunctive Deductive Databases : Semantics , Updates , and Architecture ?

The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indeenite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsis...

Updates in Disjunctive Deductive Databases: A Minimal Model Based Approach

The issue of updates in Disjunctive Deductive Databases (DDDBs) under the minimal model semantics is addressed. We consider ground clause addition and deletion in a DDDB. The approach of this paper is based on manipulating the clauses of the theory to produce the required change to the minimal model structure necessary to achieve the clause addition/deletion update. First we deal with ground po...

View Updates Translations in Relational Databases

Views over databases have been studied in various directions for many years. Among these directions, translating view updates in terms of updates on the base relations has motivated many research eeorts. In this paper, we propose a method for characterizing translations of view updates, based on the notion of inverse of a relational expressions. Moreover, we characterize two kinds of updates: (...